Dependency Structure Matrix, Genetic Algorithms, and Effective Recombination
نویسندگان
چکیده
منابع مشابه
Dependency Structure Matrix Analysis: Off-line Utility of the Dependency Structure Matrix Genetic Algorithms
This paper investigates the off-line use of the dependency structure matrix genetic algorithm (DSMGA). In particular, a problem-specific crossover operator is design by performing dependency structure matrix (DSM) analysis. The advantages and disadvantages of such an off-line use are discussed. Two schemes that helps the off-line usage are proposed. Finally, those off-line schemes are demonstra...
متن کاملDependency Structure Matrix Analysis: Offline Utility of the Dependency Structure Matrix Genetic Algorithm
This paper investigates the off-line use of the dependency structure matrix genetic algorithm (DSMGA). In particular, a problemspecific crossover operator is design by performing dependency structure matrix (DSM) analysis. The advantages and disadvantages of such an off-line use are discussed. Two schemes that helps the off-line usage are proposed. Finally, those off-line schemes are demonstrat...
متن کاملOptimal Recombination in Genetic Algorithms
This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to establish polynomial solvability or NP-hardness of the ORPs, as well as direct proofs of hardness results.
متن کاملCombination and Recombination in Genetic Algorithms
Recombination is supposed to enable the component characteristics from two parents to be extracted and then reassembled in different combinations – hopefully producing an offspring that has the good characteristics of both parents. This can work only if it is possible to identify which parts of each parent should be extracted. Crossover in the standard GA, for example, takes subsets of genes th...
متن کاملGenetic algorithms with multi-parent recombination
In this paper we investigate genetic algorithms where more than two parents are involved in the recombination operation. In particular, we introduce gene scanning as a reproduction mechanism that generalizes classical crossovers, such as n-point crossover or uniform crossover, and is applicable to an arbitrary number (two or more) of parents. We performed extensive tests for optimizing numerica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2009
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco.2009.17.4.17409